A Note on the Relation between a Sampling Theorem for Functions over a GF (q)n Domain and Linear Codes

نویسندگان

Yoshifumi Ukita

Tomohiko Saito

Toshiyasu Matsushima

Shigeichi Hirasawa

چکیده

In this paper, we generalize the sampling theorem for bandlimited functions over the Boolean domain to a sampling theorem for bandlimited functions over a GF (q) domain. We also present a theorem for the relation between the parity check matrix of a linear code and any distinct error vectors. Lastly, we clarify the relation between the sampling theorem for functions over a GF (q) domain and linear codes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3

Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...

متن کامل

A generalized Gleason-Pierce-Ward theorem

The Gleason-Pierce-Ward theorem gives constraints on the divisor and field size of a linear divisible code over a finite field whose dimension is half of the code length. This result is a departure point for the study of self-dual codes. In recent years, additive codes have been studied intensively because of their use in additive quantum codes. In this work, we generalize the GleasonPierce-War...

متن کامل

A nondeterministic space-time tradeoff for linear codes

We consider nondeterministic D-way branching programs computing functions f : D → {0, 1} in time at most kn. In the boolean case, where D = {0, 1}, no exponential lower bounds are known even for k = 2. Ajtai has proved such lower bounds for explicit functions over domains D of size at least n, and Beame, Saks and Thathachar for explicit functions over domains of size at least 2 k . In this note...

متن کامل

Enumeration of Linear Codes by Applying Methods from Algebraic Combinatorics

It is demonstrated how classes of linear (n, k)-codes can be enumerated using cycle index polynomials and other methods from algebraic combinatorics. Some results of joined work [9] with Prof. Kerber from the University of Bayreuth on the enumeration of linear codes over GF (q) are presented. Furthermore I will give an introduction to enumeration under finite group actions. At first let me draw...

متن کامل